Single-track circuit codes
نویسندگان
چکیده
Single-track circuit codes are circuit codes with codewords of length n such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the rst track. These codes simul taneously generalise single-track Gray codes and ordinary circuit codes. They are useful in angular quantisation applications in which error detecting and/or correcting capabilities are needed. A parameter, k, called the spread of the code, measures the strength of this error control capability. We consider the existence of single-track circuit codes for small lengths n 17 and spreads k 6, constructing some optimal and many good examples. We then give a general construction method for single-track circuit codes which makes use of ordinary circuit codes. We use this construction to construct examples of codes with 360 and 1000 codewords which are of practical importance. We also use the construction to prove a general result on the existence of single-track circuit codes for general spreads.
منابع مشابه
Snakes, coils, and single-track circuit codes with spread k
The snake-in-the-box problem is concerned with finding a longest induced path in a hypercube Qn. Similarly, the coil-in-the-box problem is concerned with finding a longest induced cycle in Qn. We consider a generalization of these problems that considers paths and cycles where each pair of vertices at distance at least k in the path or cycle are also at distance at least k in Qn. We call these ...
متن کاملNear optimal single-track Gray codes
Single-track Gray codes are a special class of Gray codes which have advantages over conventional Gray codes in certain quantization and coding applications. The problem of constructing high period single-track Gray codes is considered. Three iterative constructions are given, along with a heuristic method for obtaining good seed-codes. In combination, these yield many families of very high per...
متن کاملThe structure of single-track Gray codes
Single-track Gray codes are cyclic Gray codes with codewords of length n, such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the first track. We investigate the structure of such binary codes and show that there is no such code with 2n codewords when n is a power of 2. This implies that the known codes with 2n 2n codewords, when n is ...
متن کاملFinding Single Track Gray Codes with SAT
Binary Codes are used in channel encodings, but also for encoding positions that can be decoded by sensors. These binary codes can be constructed, however, a code can also be found by searching a solution for a given specification. The paper presents how to specify codes for gray codes and single track gray codes, similar to [1].
متن کاملA new construction for n-track (d, k) codes with redundancy
A new construction for n-track (d; k) codes with redundancy r, referred to as (d; k;n; r) codes, is presented. This construction applies single-track (d; k+ k) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d; k;n; r) codes, has simple encoders and decoders, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001